Optimal Search Auctions with Correlated Bidder Types∗
نویسندگان
چکیده
We study optimal auctions when contacting prospective bidders is costly and the bidders’ values are correlated. Although full surplus extraction is in general impossible, we can construct a search mechanism that fully extracts the surplus with an arbitrarily high probability. JEL Classification: D44, D82, D83
منابع مشابه
Envy-Free Sponsored Search Auctions with Budgets
We study the problem of designing envy-free sponsored search auctions, where bidders are budgetconstrained. Our primary goal is to design auctions that maximize social welfare and revenue — two classical objectives in auction theory. For this purpose, we characterize envy-freeness with budgets by proving several elementary properties including consistency, monotonicity and transitivity. Based o...
متن کاملTruthful unit-demand auctions with budgets revisited
We consider auctions of indivisible items to unit-demand bidders with budgets. This setting was suggested as an expressive model for single sponsored search auctions. Prior work presented mechanisms that compute bidder-optimal outcomes and are truthful for a restricted set of inputs, i.e., inputs in so-called general position. This condition is easily violated. We provide the first mechanism th...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملThe Value of Knowing Your Enemy
Many auction settings implicitly or explicitly require that bidders are treated equally exante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or impossible to enforce. We study so-called anonymous auctions to understand the revenue tradeoffs and to develop simple anonymous auctions that are approximately optim...
متن کاملRepeated Auctions under Budget Constraints: Optimal bidding strategies and Equilibria
How should agents bid in repeated sequential auctions when they are budget constrained? A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of generalized second price (GSP) auctions. These auctions, specifically in the context of sponsored search, have many idiosyncratic features that distinguish them from other models of sequential auctions: First, e...
متن کامل